On minimally 3-connected graphs on a surface
نویسنده
چکیده
It is well-known that the maximal size of minimally 3-connected graphs of order 7 ≥ n is 9 3 − n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, and is embedded in a closed surface with Euler characteristic , χ then G contains at most } 2 , 2 min{ 2 χ − n edges. This bound is best possible for every closed surface.
منابع مشابه
Decomposition characterizations of classes of 2-connected graphs
By applying the Tutte decomposition of 2{connected graphs into 3{block trees we provide unique structural characterizations of several classes of 2{connected graphs, including minimally 2{connected graphs, minimally 2{edge{connected graphs, critically 2{connected graphs, critically 2{edge{connected graphs, 3{edge{connected graphs, 2{connected cubic graphs and 3{connected cubic graphs. We also g...
متن کاملA non-planar version of Tutte's wheels theorem
Thtte's Wheels Theorem states that a minimally 3-connected non-wheel graph G with at least four vertices contains at least one edge e such that the contraction of e from G produces a graph which is both 3-connected and simple. The edge e is said to be non-essential. We show that a minimally 3-connected graph which is non-planar contains at least six non-essential edges. The wheel graphs are the...
متن کاملA new algorithm to determine minimally k-edge- connected graphs with odd k
A necessary and sufficient condition for a graph to be minimally k-edge-connected where k is odd is presented. Based on this result, a divide-and-conquer algorithm to determine minimally k-edge-connected graphs is developed. Experiments are performed to check minimally 3-edge-connectivity. The results show that our algorithm is much more effective than the previously known best algorithm.
متن کاملOn Connectivity in Matroids and Graphs
In this paper we derive several results for connected matroids and use these to obtain new results for 2-connected graphs. In particular, we generalize work of Murty and Seymour on the number of two-element cocircuits in a minimally connected matroid, and work of Dirac, Plummer and Mader on the number of vertices of degree two in a minimally 2-connected graph. We also solve a problem of Murty b...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 11 شماره
صفحات -
تاریخ انتشار 2002